Mixed-radix Algorithm for the Computation of Forward and Inverse MDCT

نویسندگان

  • Jiasong Wu
  • Huazhong Shu
  • Lotfi Senhadji
  • Limin Luo
چکیده

The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorithm, is obtained by decomposing an -point MDCT into two MDCTs with the length /2. The N N second algorithm, called the radix-3 decimation in time (DIT) algorithm, is obtained by decomposing an -point MDCT into three N MDCTs with the length /3. Since the proposed MDCT algorithm is also expressed in the form of a simple sparse matrix N factorization, the corresponding IMDCT algorithm can be easily derived by simply transposing the matrix factorization. Comparison of the proposed algorithm with some existing ones shows that our proposed algorithm is more suitable for parallel implementation and especially suitable for the layer III of MPEG-1 and MPEG-2 audio encoding and decoding. Moreover, the proposed algorithm can be easily extended to the multidimensional case by using the vector-radix method. Author

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved and Extended Mixed-Radix Decimation in Frequency Fast MDCT Algorithm

Recently, a mixed-radix decimation in frequency (DIF) fast MDCT algorithm only for the mixed-radix decompositions or composite lengths N = 3m×2, m > 0, has been proposed in [4]. An improved mixed-radix DIF fast MDCT algorithm both in terms of the regularity and computational complexity is described. Based on observed simple algebraic identities in the original proposed algorithm [4], new formul...

متن کامل

A fast algorithm for the computation of 2-D forward and inverse MDCT

A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...

متن کامل

Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding

The modified discrete cosine transform (MDCT) is always employed in transform-coding schemes as the analysis/ synthesis filter bank. In this paper, an efficient algorithm for MDCT and inverse MDCT (IMDCT) computation for MPEG-1 audio layer III and MPEG-2 international audio-coding standards is proposed, using only the type-II DCT. Finally, the proposed algorithm is compared to the similar algor...

متن کامل

Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms

The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...

متن کامل

Computation of forward and inverse MDCT using Clenshaw's recurrence formula

The forward and inverse modified discrete cosine transform (MDCT) are two of the most computational intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw’s recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011